ROSE: Robust Searchable Encryption With Forward and Backward Security

Dynamic searchable symmetric encryption (DSSE) has been widely recognized as a promising technique to delegate update and xmlns:xlink="http://www.w3.org/1999/xlink">search queries over an outsourced database untrusted server while guaranteeing the privacy of data. Many efforts on DSSE have devoted obtaining good tradeoff between security performance. However, it appears that all existing works miss studying what will happen if client issues irrational carelessly, such duplicate xmlns:xlink="http://www.w3.org/1999/xlink">delete remove non-existent entries (that considered by many popular system in setting plaintext). In this scenario, we find (1) most prior lose their claimed correctness or security, (2) no single approach can achieve correctness, forward backward practical performance at same time. To address problem, study for first time notion robustness DSSE. Generally, say scheme is robust keep even case misoperations. Then, introduce new cryptographic primitive named key-updatable pseudo-random function apply constructing ROSE, with security. Finally, demonstrate efficiency ROSE give experimental comparisons.